HGA : A Hardware - Based Genetic
نویسنده
چکیده
A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize ooer great rewards to genetic algorithms. Speedups of 1{3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable eld-pro-grammable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. It was designed using VHDL to allow for easy scala-bility. It is designed to act as a coprocessor with the CPU of a PC. The user programs the FPGAs which implement the function to be optimized. Other GA parameters may also be speciied by the user. Simulation results and performance analyses of the HGA are presented. A prototype HGA is described and compared to a similar GA implemented in software. In the simple tests, the prototype took about 6% as many clock cycles to run as the software-based GA. Further suggested improvements could realistically make the HGA 2{3 orders of magnitude faster than the software-based GA.
منابع مشابه
A Hardware Engine for Genetic AlgorithmsTechnical Report UNL - CSE - 97 - 001 University of Nebraska - LincolnJuly 4 , 1997 Stephen
A genetic algorithm (GA) is an optimization method based on natural selection. Genetic algorithms have been applied to many hard optimization problems including VLSI layout optimization, boolean satis ability, power system control, fault detection, control systems, and signal processing. GAs have been recognized as a robust general-purpose optimization technique. But application of GAs to incre...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملA Basic Period Approach for Solving the Economic Lot and Delivery Scheduling in Flexible Flow Lines
In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملIntegrated Forward and Reverse Logistics Model: a Case Study in Distilling and Sale Company in Korea
This paper aims to build integrated forward and reverse logistics model, and to optimize it with closed loop supply chain (CLSC). After that, we evaluate the effectiveness of the proposed model with the numerical examples, and simulate it with a bottles distilling/sale company in Korea. This paper designs the method of calculation for a solution using optimization algorithms with the priority-b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995